Improvements to Inference Compilation for Probabilistic Programming in Large-Scale Scientific Simulators

نویسندگان

  • Mario Lezcano Casado
  • Atilim Gunes Baydin
  • David Martinez Rubio
  • Tuan Anh Le
  • Frank D. Wood
  • Lukas Heinrich
  • Gilles Louppe
  • Kyle Cranmer
  • Karen Ng
  • Wahid Bhimji
  • Prabhat
چکیده

We consider the problem of Bayesian inference in the family of probabilistic models implicitly defined by stochastic generative models of data. In scientific fields ranging from population biology to cosmology, low-level mechanistic components are composed to create complex generative models. These models lead to intractable likelihoods and are typically non-differentiable, which poses challenges for traditional approaches to inference. We extend previous work in “inference compilation”, which combines universal probabilistic programming and deep learning methods, to large-scale scientific simulators, and introduce a C++ based probabilistic programming library called CPPROB. We successfully use CPPROB to interface with SHERPA, a large code-base used in particle physics. Here we describe the technical innovations realized and planned for this library.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compiling Probabilistic Logic Programs into Sentential Decision Diagrams

Knowledge compilation algorithms transform a probabilistic logic program into a circuit representation that permits efficient probability computation. Knowledge compilation underlies algorithms for exact probabilistic inference and parameter learning in several languages, including ProbLog, PRISM, and LPADs. Developing such algorithms involves a choice, of which circuit language to target, and ...

متن کامل

Anytime Inference in Probabilistic Logic Programs with Tp-Compilation

Existing techniques for inference in probabilistic logic programs are sequential: they first compute the relevant propositional formula for the query of interest, then compile it into a tractable target representation and finally, perform weighted model counting on the resulting representation. We propose TP -compilation, a new inference technique based on forward reasoning. TP -compilation pro...

متن کامل

Inference Compilation and Universal Probabilistic Programming

We introduce a method for using deep neural networks to amortize the cost of inference in models from the family induced by universal probabilistic programming languages, establishing a framework that combines the strengths of probabilistic programming and deep learning methods. We call what we do “compilation of inference” because our method transforms a denotational specification of an infere...

متن کامل

TP-Compilation for inference in probabilistic logic programs

We propose TP-compilation, a new inference technique for probabilistic logic programs that is based on forward reasoning. TP-compilation proceeds incrementally in that it interleaves the knowledge compilation step for weighted model counting with forward reasoning on the logic program. This leads to a novel anytime algorithm that provides hard bounds on the inferred probabilities. The main diff...

متن کامل

LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1712.07901  شماره 

صفحات  -

تاریخ انتشار 2017